Robust 2D Shape Correspondence using Geodesic Shape Context

نویسنده

  • Varun Jain
چکیده

A meaningful correspondence and similarity measure between shapes is particularly useful in applications such as morphing, object recognition, shape registration and retrieval. In this paper, we present a robust shape descriptor for points along a 2D contour, based on the curvature distribution collected over bins arranged geodesically along the contour. Convolution, binning and hysteresis thresholding of curvatures are applied to render the descriptor more robust against noise and non-rigid shape deformation. Once the shape descriptor is computed for every point or feature vertex of the two shapes to be matched, a one-to-one correspondence can be quickly established through best matching of the descriptors, aided by a proximity heuristic. Our approach does not rely on the linear ordering of the points along a contour, facilitating its 3D generalization. It is also capable of matching all the points along the contour, not just a specified set of feature vertices. Our shape descriptor is intuitive, fast to compute, shape distinguishing, and easy to implement. The performance of our approach, when applied to shape correspondence and shape retrieval on the Brown database and the articulated shapes database of Ling et al., shows that it is robust against both rigid and common non-rigid transformations such as bending and moderate stretching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Correspondence and Retrieval of Articulated Shapes

We consider the problem of shape correspondence and retrieval. Although our focus is on articulated shapes, the methods developed are applicable to any shape specified as a contour, in the 2D case, or a surface mesh, in 3D. We propose separate methods for 2D and 3D shape correspondence and retrieval, but the basic idea for both is to characterize shapes using intrinsic measures, defined by geod...

متن کامل

Non-Rigid Spectral Correspondence of Triangle Meshes

We present an algorithm for finding a meaningful vertex-to-vertex correspondence between two triangle meshes, which is designed to handle general non-rigid transformations. Our algorithm operates on embeddings of the two shapes in the spectral domain so as to normalize them with respect to uniform scaling and rigid-body transformation. Invariance to shape bending is achieved by relying on appro...

متن کامل

2D Shape Analysis using Geodesic Distance

Shape analysis is a fundamental and difficult problem in computer vision. It is crucial for recognition, video tracking, image retrieval and other applications. This paper proposes 2D shape analysis by using geodesic distance. It focuses on how to apply geodesic distance for shape matching and shape decomposition. Geodesic Fourier Descriptors is developed as a kind of shape representation for s...

متن کامل

An improved 3D shape context based non-rigid registration method and its application to small animal skeletons registration

3D shape context is a method to define matching points between similar shapes. It can be used as a pre-processing step in a non-rigid registration. The main limitation of the method is point mismatching, which includes long geodesic distance mismatch causing wrong topological structure, and neighbors crossing mismatch between two adjacent points. In this paper, we propose a topological structur...

متن کامل

Matching 2 D & 3 D Articulated Shapes using Eccentricity

Shape matching should be invariant to the typical intra-class deformations present in nature. The majority of shape descriptors are quite complex and not invariant to the deformation or articulation of object parts. Geodesic distances computed over a 2D or 3D shape are articulation insensitive. The eccentricity transform considers the length of the longest geodesics. It is robust with respect t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005